A Substructural Epistemic Resource Logic ( Extended Version ) 17 October , 2016 Didier Galmiche Pierre Kimmel
نویسندگان
چکیده
We present a substructural epistemic logic, based on Boolean BI, in which the epistemic modalities are parametrized on agents’ local resources. The new modalities can be seen as generalizations of the usual epistemic modalities. The logic combines Boolean BI’s resource semantics with epistemic agency. We give a labelled tableaux calculus and establish soundness and completeness with respect to the resource semantics. We illustrate the use of the logic by discussing an example of side-channels in access control using resource tokens. A Substructural Epistemic Resource Logic (Extended Version) Didier Galmiche Pierre Kimmel David Pym
منابع مشابه
A Substructural Epistemic Resource Logic
We present a substructural epistemic logic, based on Boolean BI, in which the epistemic modalities are parametrized on agents’ local resources. The new modalities can be seen as generalizations of the usual epistemic modalities. The logic combines Boolean BI’s resource semantics with epistemic agency. We give a labelled tableaux calculus and establish soundness and completeness with respect to ...
متن کاملA Substructural Epistemic Resource Logic and Its Use in Systems Security Modelling
We present a substructural epistemic logic, based on Boolean BI, in which the epistemic modalities are parametrized on the agent’s local resource. The new modalities can be seen as generalizations of the usual epistemic modalities. The logic combines Boolean BI’s resource semantics with epistemic agency. We give a labelled tableaux calculus and establish soundness and completeness with respect ...
متن کاملA logic of separating modalities
We present a logic of separating modalities, LSM, that is based on Boolean BI. LSM’s modalities, which generalize those of S4, combine, within a quite general relational semantics, BI’s resource semantics with modal accessibility. We provide a range of examples illustrating their use for modelling. We give a proof system based on a labelled tableaux calculus with countermodel extraction, establ...
متن کاملA proof-theoretic semantic analysis of dynamic epistemic logic
The present paper provides an analysis of the existing proof systems for dynamic epistemic logic from the viewpoint of proof-theoretic semantics. Dynamic epistemic logic is one of the best known members of a family of logical systems which have been successfully applied to diverse scientific disciplines, but the proof theoretic treatment of which presents many difficulties. After an illustratio...
متن کاملA Proof Search System for a Modal Substructural Logic Based on Labelled Deductive Systems
This paper describes a proof search system for a non{classical logic (modal concatenation (substructural) logic) based on Gabbay's Labelled Deductive System (LDS). The logic concerned is treated as a case study. It has some unusual features which combine resource (linear, Lambek Calculus or relevance logics) with modality (intensional, temporal, or epistemic logics), and may have some useful ap...
متن کامل